Percolation and cluster distribution. III. Algorithms for the site-bond problem
نویسندگان
چکیده
منابع مشابه
Bond and site percolation in three dimensions.
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be p(c)(bond)=0.24881182(10) and p(c)(site)=0.3116077(2). By performing extensive simulations at these estimated critical points, we then estimate the critical exponents 1/ν=1.1410(15), β/ν=0.47705(15), the leading correction exponent y(i)=-1.2(2),...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولExtraordinary Behavior in Correlated Site-Bond Percolation
Site-bond percolation is addressed in a very general class of correlated sitebond systems. The site-bond model analyzed provides a simple natural picture of disordered media such as porous materials, non-uniform surfaces adsorption potential, conductivity of inhomogeneous systems and landscapes. The bond (site) percolation threshold exhibits an extraordinary behavior, showing maxima and minima ...
متن کاملA real-space renormalization group for site and bond percolation?
We develop a real-space renormalization group which renormalizes probabilities directly in the percolation problem. An exact transformation is given in one dimension, and a cluster approach is presented for other lattices. Our results are in excellent agreement with series calculations for the critical percolation concentration p, (both site and bond), and in good agreement for the correlation ...
متن کاملCompeting Long-Range Bonds and Site Dilution in the One-Dimensional Bond-Percolation Problem
The long-range bond-percolation problem, on a linear chain (d = 1), in the presence of diluted sites (with an occupancy probability ps for an active site) is studied by means of a Monte Carlo simulation. The occupancy probability for a bond between two active sites i and j, separated by a distance rij is given by pij = p/r ij , where p represents the usual occupancy probability between nearest-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 1979
ISSN: 0022-4715,1572-9613
DOI: 10.1007/bf01011170